Interpolation by convex quadratic splines
نویسندگان
چکیده
منابع مشابه
Interpolation by Convex Quadratic Splines
Algorithms are presented for computing a quadratic spline interpolant with variable knots which preserves the monotonicity and convexity of the data. It is also shown that such a spline may not exist for fixed knots.
متن کاملConvex Approximation by Quadratic Splines
Given a convex function f without any smoothness requirements on its derivatives, we estimate its error of approximation by C 1 convex quadratic splines in terms of ! 3 (f; 1=n).
متن کاملConvex Interpolation by Splines of Arbitrary Degree
An algorithm is described for computing an interpolation spline of arbitrary but fixed degree which preserves the convexity of the given data set. Necessary and sufficient conditions for the solvability of the problem, some special cases and error estimations are given.
متن کاملInterpolation of fuzzy data by using flat end fuzzy splines
In this paper, a new set of spline functions called ``Flat End Fuzzy Spline" is defined to interpolate given fuzzy data. Some important theorems on these splines together with their existence and uniqueness properties are discussed. Then numerical examples are presented to illustrate the differences between of using our spline and other interpolations that have been studied before.
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1978
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1978-0481734-6